Some Optimal Results on Symport/Antiport P Systems with Minimal Cooperation
نویسندگان
چکیده
1 Institute of Mathematics and Computer Science Academy of Sciences of Moldova Str. Academiei 5, Chişinău, MD 2028, Moldova E-mail: {artiom,rogozhin}@math.md 2 Research Group on Mathematical Linguistics Rovira i Virgili University Pl. Imperial Tàrraco 1, 43005 Tarragona, Spain E-mail: [email protected] 3 Faculty of Informatics Vienna University of Technology Favoritenstr. 9–11, A–1040 Vienna, Austria E-mail: [email protected]
منابع مشابه
Towards a Characterization of P Systems with Minimal Symport/Antiport and Two Membranes
We prove that any set of numbers containing zero generated by symport/antiport P systems with two membranes and minimal cooperation is finite (for both symport/antiport P systems and for purely symport P systems). On the other hand, one additional object in the output membrane allows symport/antiport P systems with two membranes and minimal cooperation generate any recursively enumerable sets o...
متن کاملMinimal Cooperation in Symport/Antiport P Systems with One Membrane
In this paper we consider symport/antiport P systems with one membrane and rules having at most two objects. Although it has been proved that only finite number sets can be generated by both OP1(sym2) (one-membrane systems with symport rules of weight at most 2) and OP1(sym1, anti1) (one-membrane systems with symport/antiport rules of weight 1), the exact characterization is still an open quest...
متن کاملMinimal Cooperation in Symport/antiport Tissue P Systems
We investigate tissue P systems with symport/antiport with minimal cooperation, i.e., when only 2 objects may interact. We show that 2 cells are enough in order to generate all recursively enumerable sets of numbers. Moreover, constructed systems simulate register machines and have purely deterministic behavior. We also investigate systems with one cell and we show that they may generate only f...
متن کاملGenerating Languages by P Systems with Minimal Symport/Antiport
It is known that P systems with two membranes and minimal symport/antiport rules are “almost” computationally complete as generators of number or vector sets. Interpreting the result of the computation as the sequence of terminal symbols sent to the environment, we show that P systems with two membranes and symport rules of weight two or symport/antiport rules of weight one generate all recursi...
متن کاملAbout P systems with symport/antiport
It is proved that four membranes suffice to P systems with minimal symport/antiport to generate all recursively enumerable sets of numbers. It is also proved that P systems with symport/antiport without maximal parallelism are equivalent to partially blind counter automata.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005